REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS
Identifieur interne : 000510 ( Main/Exploration ); précédent : 000509; suivant : 000511REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS
Auteurs : J. M. Corchado [Espagne] ; M. Glez Edia [Espagne] ; Y. De Paz [Espagne] ; J. Bajo [Espagne] ; J. F. De Paz [Espagne]Source :
- Computational Intelligence [ 0824-7935 ] ; 2008-05.
English descriptors
Abstract
This paper proposes a replanning mechanism for deliberative agents as a new approach to tackling the frame problem. We propose a beliefs desires and intentions (BDI) agent architecture using a case‐based planning (CBP) mechanism for reasoning. We discuss the characteristics of the problems faced with planning where constraint satisfaction problems (CSP) resources are limited and formulate, through variation techniques, a reasoning model agent to resolve them. The design of the agent proposed, named MRP‐Ag (most‐replanable agent), will be evaluated in different environments using a series of simulation experiments, comparing it with others such as E‐Ag (Efficient Agent) and O‐Ag (Optimum Agent). Last, the most important results will be summarized, and the notion of an adaptable agent will be introduced.
Url:
DOI: 10.1111/j.1467-8640.2008.00323.x
Affiliations:
Links toward previous steps (curation, corpus...)
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS</title><author><name sortKey="Corchado, J M" sort="Corchado, J M" uniqKey="Corchado J" first="J. M." last="Corchado">J. M. Corchado</name></author><author><name sortKey="Glez Edia, M" sort="Glez Edia, M" uniqKey="Glez Edia M" first="M." last="Glez Edia">M. Glez Edia</name></author><author><name sortKey="De Paz, Y" sort="De Paz, Y" uniqKey="De Paz Y" first="Y." last="De Paz">Y. De Paz</name></author><author><name sortKey="Bajo, J" sort="Bajo, J" uniqKey="Bajo J" first="J." last="Bajo">J. Bajo</name></author><author><name sortKey="De Paz, J F" sort="De Paz, J F" uniqKey="De Paz J" first="J. F." last="De Paz">J. F. De Paz</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D4E49B738B1E4CBB94F26A6DEA5E2FF142C9B6ED</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1111/j.1467-8640.2008.00323.x</idno><idno type="url">https://api.istex.fr/document/D4E49B738B1E4CBB94F26A6DEA5E2FF142C9B6ED/fulltext/pdf</idno><idno type="wicri:Area/Main/Corpus">000B07</idno><idno type="wicri:Area/Main/Curation">000A95</idno><idno type="wicri:Area/Main/Exploration">000510</idno><idno type="wicri:explorRef" wicri:stream="Main" wicri:step="Exploration">000510</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS</title><author><name sortKey="Corchado, J M" sort="Corchado, J M" uniqKey="Corchado J" first="J. M." last="Corchado">J. M. Corchado</name><affiliation wicri:level="1"><country xml:lang="fr">Espagne</country><wicri:regionArea>Departamento de Informática y Automática, University of Salamanca</wicri:regionArea><wicri:noRegion>University of Salamanca</wicri:noRegion></affiliation></author><author><name sortKey="Glez Edia, M" sort="Glez Edia, M" uniqKey="Glez Edia M" first="M." last="Glez Edia">M. Glez Edia</name><affiliation wicri:level="1"><country xml:lang="fr">Espagne</country><wicri:regionArea>Departamento de Informática y Automática, University of Salamanca</wicri:regionArea><wicri:noRegion>University of Salamanca</wicri:noRegion></affiliation></author><author><name sortKey="De Paz, Y" sort="De Paz, Y" uniqKey="De Paz Y" first="Y." last="De Paz">Y. De Paz</name><affiliation wicri:level="1"><country xml:lang="fr">Espagne</country><wicri:regionArea>Departamento de Informática y Automática, University of Salamanca</wicri:regionArea><wicri:noRegion>University of Salamanca</wicri:noRegion></affiliation></author><author><name sortKey="Bajo, J" sort="Bajo, J" uniqKey="Bajo J" first="J." last="Bajo">J. Bajo</name><affiliation wicri:level="1"><country xml:lang="fr">Espagne</country><wicri:regionArea>Departamento de Informática y Automática, University of Salamanca</wicri:regionArea><wicri:noRegion>University of Salamanca</wicri:noRegion></affiliation></author><author><name sortKey="De Paz, J F" sort="De Paz, J F" uniqKey="De Paz J" first="J. F." last="De Paz">J. F. De Paz</name><affiliation wicri:level="1"><country xml:lang="fr">Espagne</country><wicri:regionArea>Departamento de Informática y Automática, University of Salamanca</wicri:regionArea><wicri:noRegion>University of Salamanca</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Computational Intelligence</title><idno type="ISSN">0824-7935</idno><idno type="eISSN">1467-8640</idno><imprint><publisher>Blackwell Publishing Inc</publisher><pubPlace>Malden, USA</pubPlace><date type="published" when="2008-05">2008-05</date><biblScope unit="volume">24</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="77">77</biblScope><biblScope unit="page" to="107">107</biblScope></imprint><idno type="ISSN">0824-7935</idno></series><idno type="istex">D4E49B738B1E4CBB94F26A6DEA5E2FF142C9B6ED</idno><idno type="DOI">10.1111/j.1467-8640.2008.00323.x</idno><idno type="ArticleID">COIN323</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0824-7935</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>case‐based reasoning</term><term>deliberative agents</term><term>execution time</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This paper proposes a replanning mechanism for deliberative agents as a new approach to tackling the frame problem. We propose a beliefs desires and intentions (BDI) agent architecture using a case‐based planning (CBP) mechanism for reasoning. We discuss the characteristics of the problems faced with planning where constraint satisfaction problems (CSP) resources are limited and formulate, through variation techniques, a reasoning model agent to resolve them. The design of the agent proposed, named MRP‐Ag (most‐replanable agent), will be evaluated in different environments using a series of simulation experiments, comparing it with others such as E‐Ag (Efficient Agent) and O‐Ag (Optimum Agent). Last, the most important results will be summarized, and the notion of an adaptable agent will be introduced.</div></front></TEI><affiliations><list><country><li>Espagne</li></country></list><tree><country name="Espagne"><noRegion><name sortKey="Corchado, J M" sort="Corchado, J M" uniqKey="Corchado J" first="J. M." last="Corchado">J. M. Corchado</name></noRegion><name sortKey="Bajo, J" sort="Bajo, J" uniqKey="Bajo J" first="J." last="Bajo">J. Bajo</name><name sortKey="De Paz, J F" sort="De Paz, J F" uniqKey="De Paz J" first="J. F." last="De Paz">J. F. De Paz</name><name sortKey="De Paz, Y" sort="De Paz, Y" uniqKey="De Paz Y" first="Y." last="De Paz">Y. De Paz</name><name sortKey="Glez Edia, M" sort="Glez Edia, M" uniqKey="Glez Edia M" first="M." last="Glez Edia">M. Glez Edia</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/SchutzV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000510 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000510 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= SchutzV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:D4E49B738B1E4CBB94F26A6DEA5E2FF142C9B6ED
|texte= REPLANNING MECHANISM FOR DELIBERATIVE AGENTS IN DYNAMIC CHANGING ENVIRONMENTS
}}
| This area was generated with Dilib version V0.6.38. |  |